Signless Laplacian spectral radius and Hamiltonicity
نویسندگان
چکیده
منابع مشابه
Signless Laplacian spectral radius and Hamiltonicity of graphs with large minimum degree
In this paper, we establish a tight sufficient condition for the Hamiltonicity of graphs with large minimum degree in terms of the signless Laplacian spectral radius and characterize all extremal graphs. Moreover, we prove a similar result for balanced bipartite graphs. Additionally, we construct infinitely many graphs to show that results proved in this paper give new strength for one to deter...
متن کاملThe Randić index and signless Laplacian spectral radius of graphs
Given a connected graph G, the Randić index R(G) is the sum of 1 √ d(u)d(v) over all edges {u, v} of G, where d(u) and d(v) are the degree of vertices u and v respectively. Let q(G) be the largest eigenvalue of the singless Laplacian matrix of G and n = |V (G)|. Hansen and Lucas (2010) made the following conjecture:
متن کاملSpectral radius and signless Laplacian spectral radius of strongly connected digraphs
Article history: Received 15 April 2014 Accepted 5 May 2014 Available online 29 May 2014 Submitted by R. Brualdi MSC: 05C20 05C50 15A18
متن کاملOn the Signless Laplacian Spectral Radius of Cacti
A cactus is a connected graph in which any two cycles have at most one vertex in common. We determine the unique graphs with maximum signless Laplacian spectral radius in the class of cacti with given number of cycles (cut edges, respectively) as well as in the class of cacti with perfect matchings and given number of cycles.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 2010
ISSN: 0024-3795
DOI: 10.1016/j.laa.2009.09.004